adjacency list
英
美
网络 邻接表表示法; 邻接表; 邻接列表; 邻接链表; 相邻串列
双语例句
- First, the constructional method of adjacency list is given; then on this basis a fast forming algorithm of sections in distribution network is put forward.
首先给出邻接表的构造方法，基于此提出配电网分块快速形成算法。 - Some preliminary analysis of the Adjacency List representation is presented, as well as some promising experimental results.
一些邻接表表示，提出初步分析，以及一些有希望的实验结果。 - According to the characters of mid-voltage distribution system, the adjacency list of data structure is introduced to save its topology structure.
根据中压配电网的结构特点引入数据结构中邻接表来保存配电网拓扑结构。 - Based on analyzing existed structures of undigraph and characteristics of2D drawing, Classified Adjacency List which is an improving structure of undigraph is presented.
在充分分析现有无向图存储结构优缺点的基础上，结合二维工程图形的特点，提出了一种改进的无向图存储结构&分类邻接表存储结构。 - Ordered Adjacency Vertex List Structure for Subdivision Surfaces
细分曲面的有序邻接顶点表数据结构 - First of all, an adjacency list should be established and its composition chiefly includes orientation, capacity, flux and so on.
首先创建邻接表，其结构包含边的方向、容量、流量等信息。 - Algorithm of route searching based on adjacency list
基于邻接表结构的进路搜索算法研究 - The data hierarchy with parent-child relation, the data structure with serial relation, adjacency list of network schedule, the process of extended task, and recursive algorithm for creating network schedule is discussed.
讨论了网络计划生成中，父子关系数据结构、串并行关系数据结构、网络计划的邻接表、任务扩展步骤，以及生成网络计划的递归算法。 - The topology was represented with scheme-tree and adjacency list in the new model with dada saved in the database, so that data redundancy had greatly reduced and evolution was depict distinctly.
该模型用方案树与邻接表描述动态路网的拓扑结构，用数据库存储路网数据，达到了尽可能减少数据冗余度并有效揭示动态性的目的。 - According to the property of the adjacency list of graphs, the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.
根据图的邻接表的性质，提出了基于邻接表存储结构的潜藏通路搜索算法。 - A new advancing-front method which is independent of the background is introduced. A new data structure which combines structured array and adjacency list is applied in this method to increase the efficiency of search and deletion greatly.
提出了一种不依赖于背景网格的新型阵面推进法，采用结构数组与邻接表相结合的数据结构，大大提高了查找、删除操作效率。 - This algorithm introduces the conceptions of Depth__ First Search, Breadth__ First Search and Adjacency List in data structure.
该算法引入了数据结构中的深度优先搜索、广度优先搜索以及邻接表的概念。 - It is discussed how to establish an adjacency linked list, structure the KPN, and how to run the KPN in order to get optimal assembly planning.
文中论述了如何建立邻接链表、构造KPN，以及最后如何运行KPN，获得最佳装配规划。 - Because of the inverse adjacency list structure, this algorithm is much simple and easy to be fulfilled.
采用逆邻接表作为图的存储结构，该算法很容易实现。 - The back/ forward sweep distribution power flow algorithm based on adjacency list is used to checkout the feasibility of the restore path.
用基于邻接表的前推后代潮流算法校验供电恢复路径是否可行。 - Moreover, using the adjacency list of node-branch in this method, the topology is accelerated.
同时，该方法利用节点–支路邻接表，加快了拓扑速度。 - At the same time, a new data structure, which combines structured array and adjacency list, is applied to this method so as to reduce the time taken by such operation as searching, deleting and inserting.
同时采用结构数组和邻接表相结合的新型数据结构，在节点的查找、插入和删除等操作上大大减少机时，提高了网格生成效率。 - For the purpose of removing crossing nodes limitations, this paper extends the common-used adjacency list storage contracture, which can then reveal the information of nodes port completely.
为了解决节点交叉受限的约束，文中扩展了常用的邻接表存储结构，扩展的邻接表存储结构使节点端口的信息能够完全地被反映出来。 - Before this, almost documents are based on graph, such as adjacency list.
在这之前查到的文献都是基于图结构的存储方式，如邻接表等。 - In the process of building directed topology graphics, the nodes and branches are made into graphics controls, Sparse network vectors and hotspot automation connection technology are employed to construct adjacency list.
在有向拓扑结构图的建立过程中，把节点和支路制成图形控件，采用热点自动连接和稀疏向量技术建立节点和支路的邻接表，使有向拓扑结构搜索方便而快捷。 - The paper also presents an algorithm of discovering the relations between regions by boundary tracking. Adjacency List is used as storage structure of mixed graph.
为提取图像区域间的关系，提出了一种区域内外边界跟踪的方法，并给出相应的算法，同时建立了混合图的邻接表存储结构。 - It has precedence constraints between the tasks. The individual by encoded may not satisfy the constraint, so this paper adjusts the result by a reverse adjacency list.
由于任务之间存在优先约束，编码得到的个体可能不满足该约束，所以本文选用逆邻接表进行调整。